Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
141	Reconfiguring Independent Sets in Claw-Free Graphs∗ Paul Bonsma† Marcin Kami´ nski‡ Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2015-07-28 10:23:00 NP-complete problems Graph operations Graph coloring Line graph Dominating set Claw-free graph Chordal graph Graph Neighbourhood Independent set Matching Median graph
142	June 23, :19 WSPC - Proceedings Trim Size: 9in x 6in Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:08 Graph coloring NP-complete problems Graph theory Matching Color-coding Graph Chromatic polynomial Tree-depth
143	Maximum Motif Problem in Vertex-Colored Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Graph coloring Graph connectivity Combinatorial optimization Matching Vertex cover Bridge Color-coding Treewidth Neighbourhood Covering graph Incidence coloring
144	Monochromatic triangles in two-colored plane V´ıt Jel´ınek Jan Kynˇcl Rudolf Stolaˇr ´ s Valla Tomaˇ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2007-02-02 08:52:54 Graph coloring NP-complete problems Monochromatic triangle E2
145	An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-06-04 05:35:50 NP-complete problems Functional analysis Vertex cover Distribution Graph coloring Dominating set Maximal independent set
146	A semidefinite programming hierarchy for packing problems in discrete geometry David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Applications of Real Algebraic Geometry Add to Reading List Source URL: www.daviddelaat.nl Language: English NP-complete problems Operations research Independent set Optimization problem Discrete geometry Graph Duality Packing problems Mathematical optimization Planar graphs Matching Matroid
147	Spectral Graph Theory and its Applications September 14, 2004 Lecture 4 Lecturer: Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2005-06-30 12:02:45 NP-complete problems Combinatorial optimization Graph partition Cut Graph Planar separator theorem Hypergraph
148	Multi-Agent Ad Hoc Team Partitioning by Observing and Modeling Single-Agent Performance Etkin Baris Ozgul∗ , Somchaya Liemhetcharat† , and Kian Hsiang Low∗ ∗ Department of Computer Science, National University o Add to Reading List Source URL: somchaya.org Language: English - Date: 2014-12-21 21:40:58 NP-complete problems Partition problem Partition Reinforcement learning Algorithm Agent-based model Multi-agent system Graph partition Loop tiling
149	Two Layer 3D Floor Planning Paul Horn∗ Gabor Lippner∗ October 16, 2012 Add to Reading List Source URL: web.cs.du.edu Language: English - Date: 2012-10-16 21:07:17 Tree Vertex Graph connectivity Graph operations Graph coloring NP-complete problems Pathwidth

UPDATE